Slicing Tagged Objects in Ada 95
نویسندگان
چکیده
This paper presents an approach to representing dependencies for object-oriented (OO) Ada 95 programs. This new approach distinguishes subcomponents for different objects and represents the effects of polymorphism and dynamic bindings. Based on this model, we developed approaches to slicing subprograms, packages/types and hierarchies of types. Our slicing algorithm is more efficient because most of the results can be reused, and inter-subprogram slicing is transformed to intra-subprogram slicing.
منابع مشابه
Implementing Constructor Calls with Parameters in Ada 95
Ada ‘95 does not provide for a constructor mechanism with parameters for initializing newly created objects. The package Ada.Finalization provides an initialize procedure which is automatically called at object creation time, but that procedure takes only one argument, i.e. the object being operated upon. This is hardly useful, since initialization of any kind usually requires additional inform...
متن کاملToward Protected Tagged Types in Ada 95
Inheriting code which includes concurrent constructs causes a set of problems , collectively known as inheritance anomaly. This is why protected tagged types do not exist in Ada 95. Anyway, code can be written in Ada 95 which allows to safely reuse and extend the state and code encapsulated in a protected type. On the other hand, extending by adding new operations is more diicult, due to the in...
متن کاملImplementing Atomic Actions in Ada 95
Atomic actions are an important dynamic structuring technique that aid the construction of fault-tolerant concurrent systems. Although they were developed some years ago, none of the well-known commercially-available programming languages directly support their use. This paper summarizes software fault tolerance techniques for concurrent systems, evaluates the Ada 95 programming language from t...
متن کاملA New Approach for Concurrent Program Slicing
Regarding the progress made in model analysis, more complex models, and consequently more complex programs can now be analyzed. However, this remains a difficult task in particular for concurrent programs which induce a lot of combinatory. Another way to reduce this complexity is to use program decomposition. Program decomposition technics extract a part of a given program while preserving the ...
متن کاملExtending the Object-Orientedness of Ada 95
In the object-oriented extension of Ada 95 some constructs and connected type rules have been introduced that restrict the flexibility in using the whole set of features the object-oriented paradigm provides. Especially the introduction of tagged types leads to a loss of potential reuse if efficiency is of concern while the rules connected with dispatching disable full static type checking for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001